The biharmonic index of connected graphs
نویسندگان
چکیده
<abstract><p>Let $ G be a simple connected graph with the vertex set V(G) and d_{B}(u, v) biharmonic distance between two vertices u v in $. The index BH(G) of is defined as</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ = \frac{1}{2}\sum\limits_{u\in V(G)}\sum\limits_{v\in V(G)}d_{B}^2(u, n\sum\limits_{i 2}^{n}\frac{1}{\lambda_i^2(G)}, $\end{document} </tex-math></disp-formula></p> <p>where \lambda_i(G) i $-th eigenvalue Laplacian matrix n vertices. In this paper, we provide mathematical relationships some classic topological indices: first Zagreb index, forgotten Kirchhoff index. addition, extremal value on for all graphs diameter two, trees firefly are given, respectively. Finally, operations presented.</p></abstract>
منابع مشابه
Spanning 3-connected index of graphs
For an integer s > 0 and for u, v ∈ V (G) with u = v, an (s; u, v)-pathsystem of G is a subgraph H of G consisting of s internally disjoint (u, v)-paths, and such an H is called a spanning (s; u, v)-path system if V (H) = V (G). The spanning connectivity κ∗(G) of graph G is the largest integer s such that for any integer k with 1 ≤ k ≤ s and for any u, v ∈ V (G) with u = v, G has a spanning (k;...
متن کاملConnected pseudoachromatic index of complete graphs
A connected pseudocomplete n-coloring of a graph G is a (non-proper) n-coloring of the vertices of G such that each color class induces a connected subgraph and for each pair of color classes there is an edge with one end of each color; this can be viewed as a kind of “inverse image” of a clique minor. The connected pseudoachromatic index of a graph G is the largest n for which the line graph o...
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملOn the harmonic index of bicyclic graphs
The harmonic index of a graph $G$, denoted by $H(G)$, is defined asthe sum of weights $2/[d(u)+d(v)]$ over all edges $uv$ of $G$, where$d(u)$ denotes the degree of a vertex $u$. Hu and Zhou [Y. Hu and X. Zhou, WSEAS Trans. Math. {bf 12} (2013) 716--726] proved that for any bicyclic graph $G$ of order $ngeq 4$, $H(G)le frac{n}{2}-frac{1}{15}$ and characterize all extremal bicyclic graphs.In this...
متن کاملOn atom-bond connectivity index of connected graphs
The atom–bond connectivity (ABC) index of a graph G is defined as
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AIMS mathematics
سال: 2022
ISSN: ['2473-6988']
DOI: https://doi.org/10.3934/math.2022337